Siphon-based characterization of liveness and liveness-enforcing supervision for sequential resource allocation systems
نویسنده
چکیده
One of the most interesting developments from, both, a theoretical and a practical perspective, in the emerging theory of resource allocation systems (RAS), is the characterization of the non-liveness of many RAS classes through the Petri net (PN)-based structural object of empty, or more generally, deadly marked siphon. The work presented in this paper seeks to develop a general theory that provides a unifying framework for all the relevant existing results, and reveals the key structures and mechanisms that connect the RAS non-liveness to the concept of deadly marked – and in certain cases, empty – siphon. In this capacity, the presented results allow also the extension of the siphon-based characterization of non-liveness to broader RAS classes, and provide a clear and intuitive explanation for the limitations of the approach. The last part of the work discusses how the derived structural characterization of RAS non-liveness can be combined with some algorithms for detecting empty or deadly marked siphons in a given PN marking, in order to develop analytical liveness sufficiency tests and systematic procedures for the design of liveness-enforcing supervisors (LES).
منابع مشابه
LIVENESS ENFORCING SUPERVISION FOR SEQUENTIAL RESOURCE ALLOCATION SYSTEMS State of the Art and Open Issues
Liveness-enforcing supervision of sequential resource allocation systems is currently a well-defined problem, underlying the operation of many contemporary technological systems, spanning a wide spectrum of applications. This technical note provides a brief overview of the currently available results, delineating, both, our major analytical understandings/characterizations concerning the proble...
متن کاملLiveness-enforcing supervision for resource allocation systems with uncontrollable behavior and forbidden states
Although liveness enforcing supervision (LES) of sequential resource allocation systems (RAS) is currently a well-established problem in the Discrete Event System literature, all prior work on it has addressed the underlying LES synthesis problem under the assumption that the system behavior is totally controllable. The work presented in this paper seeks to develop correct and scaleable LES for...
متن کاملThe Thinning Problem
The main problem addressed in this work is how to confine the set of sequential processes of a disjunctive / conjunctive resource allocation system (D/C-RAS) to a subset of their feasible behaviors while optimizing some performance criterion. We provide a canonical characterization of this problem in the form of a Mixed Integer Programming (MIP) formulation, for the case that the optimized perf...
متن کاملLiveness Enforcing Supervision in Video Streaming Systems using Siphons
The Internet motivated video streaming systems are largely complicated by issues such as a high degree of network resource sharing amongst many flows, which potentially leads to deadlocks. Using concepts of siphons along with their corresponding dangerous markings, we derive an algebraically necessary and sufficient characterization for such a much undesirable situation. The target system is as...
متن کاملMaximally permissive deadlock avoidance for resource allocation systems with R/W-locks
This paper extends the existing theory on maximally permissive liveness-enforcing supervision of resource allocation systems (RAS) so that it can handle RAS with reader / writer (R/W-) locks. A key challenge that is posed by this new RAS class stems from the fact that the underlying state space is not necessarily finite. We effectively address this obstacle by taking advantage of special struct...
متن کامل